Adams Conditionals and Non-Monotonic Probabilities
نویسنده
چکیده
1. It is very probable that it wasn't the cook. 2. It is very probable that if it wasn't the butler, then it was the cook. Hence: 3. It is very improbable that if it wasn't the butler, then it was the gardener. Now: 4. It is certain, given that it wasn't the cook, that if it wasn't the butler, then it was the gardener. 5. It is impossible, given that it was the cook, that if it wasn't the butler, then it was the gardener. Hence: 6. It is very probable that if it wasn't the butler, then it was the gardener. A Triviality Theorem Let Ω be a set of sentences closed under the sentential operations of conjunction and negation and Π be the set of all probability measures on Ω. Let → denote a two place operation on sentences and assume that for some A and X in Ω, the sentence A→X is in Ω. Let P be a probability variable ranging over the members of Π. Adams' Theses 1. Ordinary inference is governed by considerations of probabilistic validity: roughly, the high probability of the premises ensures the high probability of the conclusion. 2. The probability of a conditional is the conditional probability of its antecedent given its consequent. over them. b. A two-place numerical function, p. c. One or more operation symbols, with the (unextended) operation of concatenation occurring in every system. d. The domain of interpretation is left unspecified Axiom System M A1. 0 ≤ p(x, z) (lower bound) A2. p(x, z) ≤ p(y, y) (upper bound) A3. xz(p(x, z) ≠ 0) (non-triviality) M1. p(xy, z) ≤ p(x, z) (monotonicity) M2. p(xy, z) = p(x, yz).p(y, z) (product rule) In M it is derivable that: 1. Idempotence: p(xx, z) = p(x, z) 2. Commutativity: p(xy, z) = p(yx, z) 3. Associativity: p(x(yz), w) = p((xy)z, w). Logic Probabilistic Implication: x y = Df z(p(x, z) ≤ p(y, z)) Probabilistic Equivalence: x ~ y = Df x y and y x is a partial order and ~ an equivalence relation. However, to identify probabilistically equivalent terms, replacement in p's second argument must be assured: A5. x ~ y p(z, x) = p(z, y) By addition of A5 to M we obtain system M +. The models of M + are reducible to lower semi-lattices. Introduction of a join operation via: J. …
منابع مشابه
Nonmonotonic conditionals that behave like conditional probabilities above a threshold
I’ll describe a range of systems for nonmonotonic conditionals that behave like conditional probabilities above a threshold. The rules that govern each system are probabilistically sound in that each rule holds when the conditionals are interpreted as conditional probabilities above a threshold level specific to that system. The well-known preferential and rational consequence relations turn ou...
متن کاملA Note on two theorems by Adams and McGee
Three-valued accounts of conditionals frequently promise (a) to conform to the probabilistic view that conditionals are evaluated by conditional probabilities, and (b) to yield a plausible account of compounds of conditionals. However, McGee (1981) shows that probabilistic validity, the conception of validity most naturally associated with the probabilistic view, cannot be characterized by a fi...
متن کاملMultidimensional Possible-world Semantics for Conditionals
Adams’ Thesis the claim that the probabilities of indicative conditionals equal the conditional probabilities of their consequents given their antecedents – has proven impossible to accommodate within orthodox possible worlds semantics. This paper considers the approaches to the problem taken by Jeffrey and Stalnaker (1994) and by McGee (1989), but rejects them on the grounds that they imply a ...
متن کاملProbabilities of Conditionals and Conditional Probabilities Ii
A dams's thesis about indicative conditionals is that their assertIlability goes by the conditional subjective probability of the consequent given the antecedent, in very much the same way that assertability normally goes by the subjective probability of truth.' The thesis is well established; the remaining question is how it may best be explained. The nicest explanation would be that the truth...
متن کاملThe Fall of "Adams' Thesis"?
The so-called ̳Adams‘ Thesis‘ is often understood as the claim that the assertibility of an indicative conditional equals the corresponding conditional probability—schematically: (AT) As(A B) = P(B | A), provided P(A) ≠ 0. The Thesis is taken by many to be a touchstone of any theorizing about indicative conditionals. Yet it is unclear exactly what the Thesis is. I suggest some precise stateme...
متن کاملOn the Logic of Nonmonotonic Conditionals and Conditional Probabilities: Predicate Logic
In a previous paper I described a range of nonmonotonic conditionals that behave like conditional probability functions at various levels of probabilistic support. These conditionals were defined as semantic relations on an object language for sentential logic. In this paper I extend the most prominent family of these conditionals to a language for predicate logic. My approach to quantifiers is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Journal of Logic, Language and Information
دوره 15 شماره
صفحات -
تاریخ انتشار 2006